Energy-Efficient Hybrid Flowshop Scheduling with Consistent Sublots Using an Improved Cooperative Coevolutionary Algorithm

نویسندگان

چکیده

Energy conservation, emission reduction, and green low carbon are of great significance to sustainable development, also the theme transformation upgrading manufacturing industry. This paper concentrates on studying energy-efficient hybrid flowshop scheduling problem with consistent sublots (HFSP_ECS) objective minimizing energy consumption. To solve problem, HFSP_ECS is decomposed by idea “divide-and-conquer”, resulting in three coupled subproblems, i.e., lot sequence, machine assignment, split, which can be solved using a cooperative methodology. Thus, an improved coevolutionary algorithm (vCCEA) proposed integrating variable neighborhood descent (VND) strategy. In vCCEA, considering problem-specific characteristics, two-layer encoding strategy designed represent essential information, novel collaborative model realize interaction between subproblems. addition, special structures for different two kinds enhanced search potential promising solutions. A population restart mechanism established ensure diversity. The computational results show that vCCEA coordinate each subproblem effectively, outperform mathematical programming other state-of-the-art algorithms.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Flowshop Scheduling Using Discrete Harmony Search And Genetic Algorithm

In this paper a hybrid genetic and harmony search algorithm is proposed to find the possible best sequence of operation solutions for hybrid flow shop scheduling problems. In this work the problem is considered with respect to the objective of minimization of makespan. Hybrid flow shop scheduling problem is considered for the sequencing of jobs in a hybrid flow shop with two or more identical m...

متن کامل

An improved heuristic for permutation flowshop scheduling

Flowshop scheduling deals with determination of optimum sequence of jobs to be processed on some machines in a fixed order so as to satisfy certain scheduling criteria. The general problem of scheduling has been shown to be NP-complete. Exact algorithms, such as integer programming and branch-and-bound, guarantee optimality but do not yield the optimum solution in polynomial time even for probl...

متن کامل

A Two-Stage Hybrid Flowshop Scheduling Problem with Serial Batching

In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the mac...

متن کامل

An Energy-efficient Mathematical Model for the Resource-constrained Project Scheduling Problem: An Evolutionary Algorithm

In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...

متن کامل

Energy-Efficient Scheduling Problem Using an Effective Hybrid Multi-Objective Evolutionary Algorithm

Nowadays, manufacturing enterprises face the challenge of just-in-time (JIT) production and energy saving. Therefore, study of JIT production and energy consumption is necessary and important in manufacturing sectors. Moreover, energy saving can be attained by the operational method and turn off/on idle machine method, which also increases the complexity of problem solving. Thus, most researche...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2022

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math11010077